Hardy’s inequality and its descendants: a probability approach
نویسندگان
چکیده
We formulate and prove a generalization of Hardy’s inequality [27] in terms random variables show that it contains the usual (or familiar) continuous discrete forms inequality. Next we improve recent version by Li Mao [42] with weights for general Borel measures mixed norms so implies Liao [43] Hardy Muckenhoupt [48] as well norm versions due to Littlewood [29], Bliss [8], Bradley [14]. An equivalent formulation is given well. also reverse inequality, closely related Copson Carleman-Pólya-Knopp via variables. Finally connect our counting process martingales survival analysis, briefly discuss other applications.
منابع مشابه
The coalescent and its descendants
The coalescent revolutionised theoretical population genetics, simplifying, or making possible for the first time, many analyses, proofs, and derivations, and offering crucial insights about the way in which the structure of data in samples from populations depends on the demographic history of the population. However statistical inference under the coalescent model is extremely challenging, ef...
متن کاملSzegö’s theorem and its probabilistic descendants
The theory of orthogonal polynomials on the unit circle (OPUC) dates back to Szegö’s work of 1915-21, and has been given a great impetus by the recent work of Simon, in particular his survey paper and three recent books; we allude to the title of the third of these, Szegö’s theorem and its descendants, in ours. Simon’s motivation comes from spectral theory and analysis. Another major area of ap...
متن کاملFractional Probability Measure and Its Properties
Based on recent studies by Guy Jumarie [1] which defines probability density of fractional order and fractional moments by using fractional calculus (fractional derivatives and fractional integration), this study expands the concept of probability density of fractional order by defining the fractional probability measure, which leads to a fractional probability theory parallel to the classical ...
متن کاملQuantum Searching: A survey of Grover’s Algorithm and its Descendants
One of computer science’s classic problems is that of the search. This paper will look at Lou K. Grover’s Quantum Search algorithm. This algorithm is used to search a database, or search space, that is not, and cannot be, sorted or structured. It can produce a quadratic speed up over any similar classical search. This paper will also look at some of the issues and advances that have come out of...
متن کاملBell’s inequality: Physics meets Probability
In this review we remind the viewpoint that violation of Bell’s inequality might be interpreted not only as an evidence of the alternative – either nonlocality or “death of reality” (under the assumption the quantum mechanics is incomplete). Violation of Bell’s type inequalities is a well known sufficient condition of incompatibility of random variables – impossibility to realize them on a sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2021
ISSN: ['1083-6489']
DOI: https://doi.org/10.1214/21-ejp711